Corrections to: "Semi-infinite programs and conditional Gauss variational problems"
نویسندگان
چکیده
منابع مشابه
Subsmooth semi-infinite and infinite optimization problems
We first consider subsmoothness for a function family and provide formulas of the subdifferential of the pointwsie supremum of a family of subsmooth functions. Next, we consider subsmooth infinite and semi-infinite optimization problems. In particular, we provide several dual and primal characterizations for a point to be a sharp minimum or a weak sharp minimum for such optimization problems.
متن کاملNon-Lipschitz Semi-Infinite Optimization Problems Involving Local Cone Approximation
In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.
متن کاملNonlinear Lagrangian Functions and Applications to Semi-Infinite Programs
In this paper a nonlinear penalty method via a nonlinear Lagrangian function is introduced for semi-infinite programs. A convergence result is established which shows that the sequence of optimal values of nonlinear penalty problems converges to that of semi-infinite programs. Moreover a conceptual convergence result of a discretization method with an adaptive scheme for solving semi-infinite p...
متن کاملSemi-infinite assignment problems and related games
In 1972 Shapley and Shubik introduced assignment games associated to finite assignment problems in which two types of agents were involved and they proved that these games have a non-empty core. In this paper we look at the situation where the set of one type is infinite and investigate when the core of the associated game is non-empty. Two infinite programming problems arise here, which we tac...
متن کاملGlobal solution of semi-infinite programs
A branch-and-bound procedure for the global solution of smooth, nonlinear SIPs has been developed. An upper-bounding problem is constructed using an inclusionconstrained reformulation of the infinite set of constraints, and a convex lowerbounding problem is derived from a discretized approximation of the SIP. Results are provided for a number of problems in the SIP literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hiroshima Mathematical Journal
سال: 1972
ISSN: 0018-2079
DOI: 10.32917/hmj/1206137632